Three Steps towards Better Forecasting for Streamflow Deep Learning

نویسندگان

چکیده

Elevating the accuracy of streamflow forecasting has always been a challenge. This paper proposes three-step artificial intelligence model improvement for forecasting. Step 1 uses long short-term memory (LSTM), an on conventional neural network (ANN). 2 performs multi-step ahead while establishing rates change as new approach. 3 further improves through three different kinds optimization algorithms. The Stormwater and Road Tunnel project in Kuala Lumpur is study area. Historical rainfall data 14 years at 11 telemetry stations are obtained to forecast flow confluence located next control center. reveals that LSTM better than ANN with R 0.9055, MSE 17,8532, MAE 1.4365, NSE 0.8190 RMSE 5.3695. unveils outperforms rest = 0.9545, 8.9746, 0.5434, 0.9090 2.9958. Finally, Stage 0.9757, 4.7187, 0.4672, 0.9514 2.1723 bat-LSTM hybrid algorithm. shows δQ consistently yielded promising results metaheuristic algorithms able yield additional model’s results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Neural network streamflow forecasting

Classification of heterogeneous precipitation fields for the assessment and possible improvement of lumped neural network models for streamflow forecasts N. Lauzon, F. Anctil, and C. W. Baxter Golder Associates, Calgary, Canada Département de génie civil, Pavillon Pouliot, Université Laval, Québec, G1K 7P4, Canada HYDRANNT Consulting Inc., Port Coquitlam, Canada Received: 20 December 2005 – Acc...

متن کامل

Improving Stock Return Forecasting by Deep Learning Algorithm

Improving return forecasting is very important for both investors and researchers in financial markets. In this study we try to aim this object by two new methods. First, instead of using traditional variable, gold prices have been used as predictor and compare the results with Goyal's variables. Second, unlike previous researches new machine learning algorithm called Deep learning (DP) has bee...

متن کامل

Three steps towards Gyárfás’ conjecture

Gyárfás conjectured in 1985 that for all k, l, every graph with no clique of size more than k and no odd hole of length more than l has chromatic number bounded by a function of k, l. We prove three weaker statements: • Every triangle-free graph with sufficiently large chromatic number has an odd hole of length different from five; • For all l, every triangle-free graph with sufficiently large ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2022

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app122412567